Bayesian Design for Random Walk Barriers
نویسنده
چکیده
We study the optimal design of absorption barriers and sample size for a simple random walk. High barriers yield more informative experiments, but may be more costly. We obtain optimal designs that are balancing the relative advantages of choosing a high barrier with few replications versus a lower barrier with more replications. We address the problem from a Bayesian, decision theoretic, viewpoint, by using a utility function based on a limiting form of Shannon information. After discussing properties of the optimal designs, we apply the results to a model describing the growth of cancer cells, and we illustrate how the selection of the prior distribution influences the solution.
منابع مشابه
The Laplace Transform of a Boundary Functional of the Semi- Markovian Random Walk Process with Two Delaying Barriers
In this study, a step process of semi-Markovian random walk with delaying barriers at a and b levels ( 0 b a ) and first falling moment of the process into the delaying barrier at b -level, ) ( , are mathematically constructed, in this case when the random walk happens according to the Laplace’s distribution ) 1 ; 1 ( L . It is given a simple form of the Laplace transformation of t...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملA guided walk Metropolis algorithm
The random walk Metropolis algorithm is a simple Markov chain Monte Carlo scheme which is frequently used in Bayesian statistical problems. We propose a guided walk Metropolis algorithm which suppresses some of the random walk behavior in the Markov chain. This alternative algorithm is no harder to implement than the random walk Metropolis algorithm, but empirical studies show that it performs ...
متن کاملForecasting State Tax Revenue: A Bayesian Vector Autoregression Approach By
This paper compares alternative time-series models to forecast state tax revenues. Forecast accuracy is compared to a benchmark random walk forecast. Quarterly data for California is used to forecast total tax revenue along with its three largest components, sales, income, and corporate tax revenue. For oneand four-quarter-ahead forecasts from 2004 to 2009, Bayesian vector autoregressions gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009